\relax 
\citation{f}
\citation{a}
\citation{b}
\citation{c}
\citation{d}
\citation{e}
\citation{f}
\citation{j}
\citation{h}
\@writefile{toc}{\contentsline {section}{\numberline {1} Introduction }{1}}
\citation{f}
\citation{g}
\citation{h}
\citation{i}
\citation{gg}
\citation{aa}
\citation{aa}
\citation{bb}
\citation{cc}
\citation{dd}
\citation{ee}
\citation{ff}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Motivation}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Previous work}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Definitions}{2}}
\citation{er}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.4}Brief overview of our results}{3}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Results}{3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}On General Graphs}{3}}
\citation{k}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces { A complete bipartite graph $K_{(3,2)}$. All the edges in the graph are unweighted. Closeness centrality of vertices are labeled on it. Vertex pair in set B is making the graph non center-strategic.}}}{4}}
\citation{m}
\citation{n}
\citation{l}
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces Center-Strategicness of a Graph}}{5}}
\newlabel{alg:GS}{{1}{5}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces BFS\_C}}{5}}
\newlabel{alg:GS}{{2}{5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}On Erdos-Renyi (ER) Graphs}{6}}
\newlabel{fig1}{{2(a)}{6}}
\newlabel{sub@fig1}{{(a)}{6}}
\newlabel{fig2}{{2(b)}{6}}
\newlabel{sub@fig2}{{(b)}{6}}
\newlabel{fig3}{{2(c)}{6}}
\newlabel{sub@fig3}{{(c)}{6}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Optional caption for list of figures}}{6}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(a)}{\ignorespaces {Concentration of CSP vs probability for graph with 100 nodes}}}{6}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(b)}{\ignorespaces {Connected center-strategic graphs vs probability for graph with $100$ nodes}}}{6}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(c)}{\ignorespaces {Connected center-strategic graphs vs probability for graph with $50$ nodes}}}{6}}
\newlabel{fig:subfigureExample}{{2}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}On Trees}{7}}
\newlabel{main_lemma}{{3}{7}}
\newlabel{3_v}{{3(a)}{8}}
\newlabel{sub@3_v}{{(a)}{8}}
\newlabel{3_y}{{3(b)}{8}}
\newlabel{sub@3_y}{{(b)}{8}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Optional caption for list of figures}}{8}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(a)}{\ignorespaces {$T(V,E)$}}}{8}}
\@writefile{lof}{\contentsline {subfigure}{\numberline{(b)}{\ignorespaces {$T'(V',E')$}}}{8}}
\newlabel{fig:subfigureExample}{{3}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.4}On Rectilinear Grids}{8}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces { An example of all three types of rectilinear grids.}}}{9}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces { An example explaining the lemma and representing closeness centrality by intensity of the node. Black represents highest centrality and white represents the lowest.}}}{9}}
\bibstyle{plain}
\bibcite{a}{1}
\bibcite{b}{2}
\bibcite{k}{3}
\bibcite{er}{4}
\bibcite{m}{5}
\bibcite{n}{6}
\bibcite{j}{7}
\bibcite{l}{8}
\bibcite{c}{9}
\bibcite{e}{10}
\bibcite{d}{11}
\bibcite{i}{12}
\bibcite{gg}{13}
\@writefile{toc}{\contentsline {section}{\numberline {3}Conclusion}{10}}
\bibcite{aa}{14}
\bibcite{bb}{15}
\bibcite{cc}{16}
\bibcite{dd}{17}
\bibcite{ee}{18}
\bibcite{ff}{19}
\bibcite{f}{20}
\bibcite{g}{21}
\bibcite{h}{22}
